Two-stage Interval Time Minimization Transportation Problem with Capacity Constraints
نویسندگان
چکیده
This paper discusses a two-stage interval time minimization transportation problem with capacity constraints on each source-destination link. In the current problem, the exact total demand of all the destinations lies in an interval whose end points are equal to the minimum and the maximum total available amount of the homogeneous product (which is being transported), at the sources. The minimum amount available at the sources is transported in the first stage of transportation, while enough amount of the product is shipped in the second stage so as to meet the exact total demand of the destinations. The objective of the current paper is to obtain a transportation schedule so that the transportation in both the stages is carried out in the minimum possible time. A polynomial time iterative algorithm is proposed which generates a sequence of pairs of Stage-I and Stage-II times. Firstly, a related standard cost minimization transportation problem (CMTP) is solved and then at each iteration, a restricted version of this CMTP is solved in which the time of Stage-I decreases strictly and the time of Stage-II increases. Out of these generated pairs, a pair with the minimum sum of transportation times of Stage-I and Stage-II is considered as the global optimal solution. Numerical illustration is included in the support of the theory.
منابع مشابه
A Genetic Algorithm Developed for a Supply Chain Scheduling Problem
This paper concentrates on the minimization of total tardiness and earliness of orders in an integrated production and transportation scheduling problem in a two-stage supply chain. Moreover, several constraints are also considered, including time windows due dates, and suppliers and vehicles availability times. After presenting the mathematical model of the problem, a developed version of GA c...
متن کاملBi-objective Optimization for Just in Time Scheduling: Application to the Two-Stage Assembly Flow Shop Problem
This paper considers a two-stage assembly flow shop problem (TAFSP) where m machines are in the first stage and an assembly machine is in the second stage. The objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. JIT seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective...
متن کاملTwo Stage Flow Shop Scheduling Problem Including Transportation Time and Weightage of Jobs with Branch and Bound Method
متن کامل
New Heuristic Algorithm for Flow Shop Scheduling with 3 Machines and 2 Robots Considering the Breakdown Interval of Machines and Robots Simultaneously
Scheduling is an important subject of production and operations management area. In flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria. The concept of transportation time is very important in scheduling. Transportation can be done by robots. In situations that robots are used to transpor...
متن کاملHub Covering Location Problem Considering Queuing and Capacity Constraints
In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...
متن کامل